Walks on Apollonian networks

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generalized Open Quantum Walks on Apollonian Networks

We introduce the model of generalized open quantum walks on networks using the Transition Operation Matrices formalism. We focus our analysis on the mean first passage time and the average return time in Apollonian networks. These results differ significantly from a classical walk on these networks. We show a comparison of the classical and quantum behaviour of walks on these networks.

متن کامل

Coherent transport on Apollonian networks and continuous-time quantum walks.

We study the coherent exciton transport on Apollonian networks generated by simple iterative rules. The coherent exciton dynamics is modeled by continuous-time quantum walks and we calculate the transition probabilities between two nodes of the networks. We find that the transport depends on the initial nodes of the excitation. For networks up to the second generation the coherent transport sho...

متن کامل

Random walks on the Apollonian network with a single trap

Explicit determination of the mean first-passage time (MFPT) for trapping problem on complex media is a theoretical challenge. In this paper, we study random walks on the Apollonian network with a trap fixed at a given hub node (i.e. node with the highest degree), which are simultaneously scale-free and small-world. We obtain the precise analytic expression for the MFPT that is confirmed by dir...

متن کامل

Magnetic models on Apollonian networks.

Thermodynamic and magnetic properties of Ising models defined on the triangular Apollonian network are investigated. This and other similar networks are inspired by the problem of covering a Euclidian domain with circles of maximal radii. Maps for the thermodynamic functions in two subsequent generations of the construction of the network are obtained by formulating the problem in terms of tran...

متن کامل

High dimensional Apollonian networks

We propose a simple algorithm which produces high dimensional Apollonian networks with both small-world and scale-free characteristics. We derive analytical expressions for the degree distribution, the clustering coefficient and the diameter of the networks, which are determined by their dimension. PACS numbers: 89.75.Hc, 89.75.Da, 89.20.Hh High dimensional Apollonian networks 2

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The European Physical Journal B

سال: 2006

ISSN: 1434-6028,1434-6036

DOI: 10.1140/epjb/e2006-00257-y